Scalability Improvement of the Projected Conjugate Gradient Method used in FETI Domain Decomposition Algorithms
نویسندگان
چکیده
This report summarizes the results of the scalability improvements of the algorithms used in Total FETI (TFETI). A performance evaluation of two new techniques is presented in this report: (1) a novel pipelined implementation of CG method in PETSc and (2) a MAGMA LU solver running on following many-cores accelerators: GPU Nvidia Tesla K20m and Intel MIC Xeon Phi 5110P.
منابع مشابه
The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces
Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-like iteration. Instead, they solve a constrained problem by an active set strategy and a generaliz...
متن کاملBDDC Algorithms for Incompressible Stokes Equations
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle-point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are iterative substructuring methods, which form a class of domain decomposition methods based on the decomposition of the domain ...
متن کاملA BDDC Preconditioner for Saddle Point Problems
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...
متن کاملA unified FETI-DP approach for incompressible Stokes equations
A unified framework of FETI-DP algorithms is proposed for solving the system of linear equations arising from the mixed finite element approximation of incompressible Stokes equations. A distinctive feature of this framework is that it allows using both continuous and discontinuous pressures in the algorithm, while previous FETI-DP methods only apply to discontinuous pressures. A preconditioned...
متن کاملFETI-DP Domain Decomposition Method
School of Basic Science Mathematics Section Master in Mathematical Engineering FETI-DP Domain Decomposition Method by Christoph Jäggli FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly related to...
متن کامل